Dynamic Buffer Allocation for Conserving Disk Energy in Clustered Video Servers Which Use Replication

نویسنده

  • Minseok Song
چکیده

Reducing energy consumption is a key concern in video data centers, in which disk arrays consume a significant portion of the total energy. Disks typically support multiple power modes including a low-power mode in which they use considerably less energy than in any other mode. Therefore, extending the length of time that disks stay in low-power mode is important for energy conservation. We propose a new energy-aware buffer allocation scheme for clustered video servers which use replication. We first present a data retrieval scheme which adaptively retrieves data from the primary and backup copies so as to allow disks to go into low-power mode. We then analyze the relationship between the retrieval period and the buffer size assigned to a cluster, and examine how buffer allocation influences total energy consumption. Based on this, we propose a new buffer partitioning scheme in which the retrieval period for each cluster can be dynamically changed to adjust disk utilization, with the aim of increasing the number of disks that enter low-power mode. Simulations demonstrate that our scheme saves between 22% to 43% of the energy required for conventional video server operation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Strategy to enable Prefix of Multicast VoD through dynamic buffer allocation

In this paper we have proposed a dynamic buffer allocation algorithm for the prefix, based on the popularity of the videos. More cache blocks are allocated for most popular videos and a few cache blocks are allocated for less popular videos. Buffer utilization is also maximized irrespective of the load on the Video-on-Demand system. Overload can lead the server getting slowed down. By storing t...

متن کامل

A request distribution method for clustered VOD servers considering buffer sharing effects

The clustering of multiple video servers is a popular architecture for huge VOD systems. In a clustered VOD system, user requests are distributed among the video servers by the dispatcher. Each video server consists of independent disks and a local buffer memory. The buffer mechanism is recognized helpful to the improvement of the disk performance. However, its effects have not been effectively...

متن کامل

Block Allocation in Video Servers for Availability and Throughput

ii Abstract Video servers aimed at the home market must deliver very large files at a low cost. The video files must be shared and reused to contain costs. The nature of videos, however, demand a low jitter (late block delivery) rate. Normal systems tolerate disk queues and deliver, typically, smaller objects in a less predictable manner. This paper explores in a multi disk, stripped, enviornme...

متن کامل

Minimization of buffer requirements using variable-size parity groups for fault-tolerant video servers

In this paper we propose storage allocation schemes to minimize the buffer requirements for fault-tolerant video-ondemand (VOD) servers with disk arrays. To guarantee the high reliability of video service, the servers usually adopt parity-encoding techniques in which data blocks and their associated parity block form a parity group. For real-time video service, all the blocks in a parity group ...

متن کامل

Design and Performance Tradeoffs in Clustered Video Servers

In this paper, we investigate the suitability of clustered architectures for designing scalable multimedia servers. Specifically, we evaluate the effects of: (i) architectural design of the cluster, (ii) the size of the unit of data interleaving, and (iii) read-ahead buffering and scheduling on the real-time performance guarantees provided by the server. To analyze the effects of these paramete...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006